Improved Bounds on Metastability Thresholds and Probabilities for Generalized Bootstrap Percolation
نویسنده
چکیده
We generalize and improve results of Andrews, Gravner, Holroyd, Liggett, and Romik on metastability thresholds for generalized two-dimensional bootstrap percolation models, and answer several of their open problems and conjectures. Specifically, we prove slow convergence and localization bounds for Holroyd, Liggett, and Romik’s k-percolation models, and in the process provide a unified and improved treatment of existing results for bootstrap, modified bootstrap, and Froböse percolation. Furthermore, we prove improved asymptotic bounds for the generating functions of partitions without k-gaps, which are also related to certain infinite probability processes relevant to these percolation models. One of our key technical probability results is also of independent interest. We prove new upper and lower bounds for the probability that a sequence of independent events with monotonically increasing probabilities contains no “k-gap” patterns, which interpolates the general Markov chain solution that arises in the case that all of the probabilities are equal.
منابع مشابه
Integrals, Partitions, and Cellular Automata
We prove that ∫ 1 0 − log f(x) x dx = π 3ab where f(x) is the decreasing function that satisfies fa − f b = xa − xb, for 0 < a < b. When a is an integer and b = a + 1 we deduce several combinatorial results. These include an asymptotic formula for the number of integer partitions not having a consecutive parts, and a formula for the metastability thresholds of a class of threshold growth cellul...
متن کامل1 8 Fe b 20 03 Integrals , Partitions , and Cellular Automata
We prove that ∫ 1 0 − log f(x) x dx = π2 3ab where f(x) is the decreasing function that satisfies fa − f b = xa − xb, for 0 < a < b. When a is an integer and b = a+ 1 we deduce several combinatorial results. These include an asymptotic formula for the number of integer partitions not having a consecutive parts, and a formula for the metastability thresholds of a class of threshold growth cellul...
متن کاملBootstrap Percolation on Random Geometric Graphs
Bootstrap percolation has been used effectively to model phenomena as diverse as emergence of magnetism in materials, spread of infection, diffusion of software viruses in computer networks, adoption of new technologies, and emergence of collective action and cultural fads in human societies. It is defined on an (arbitrary) network of interacting agents whose state is determined by the state of...
متن کاملSharp Metastability Threshold for Two-Dimensional Bootstrap Percolation
In the bootstrap percolation model, sites in an L by L square are initially independently declared active with probability p. At each time step, an inactive site becomes active if at least two of its four neighbours are active. We study the behaviour as p → 0 and L → ∞ simultaneously of the probability I(L, p) that the entire square is eventually active. We prove that I(L, p) → 1 if lim inf p l...
متن کاملSubcritical U-bootstrap Percolation Models Have Non-trivial Phase Transitions
We prove that there exist natural generalizations of the classical bootstrap percolation model on Z that have non-trivial critical probabilities, and moreover we characterize all homogeneous, local, monotone models with this property. Van Enter [28] (in the case d = r = 2) and Schonmann [25] (for all d > r > 2) proved that r-neighbour bootstrap percolation models have trivial critical probabili...
متن کامل